منابع مشابه
On a Periodic Soliton Cellular Automaton
We propose a box and ball system with a periodic boundary condition (pBBS). The time evolution rule of the pBBS is represented as a Boolean recurrence formula, an inverse ultradiscretization of which is shown to be equivalent with the algorithm of the calculus for the 2Nth root. The relations to the pBBS of the combinatorial R matrix of U q(A (1) N ) are also discussed.
متن کاملDouble Jump Phase Transition in a Random Soliton Cellular Automaton
In this paper, we consider the soliton cellular automaton introduced in [21] with a random initial configuration. We give multiple constructions of a Young diagram describing various statistics of the system in terms of familiar objects like birth-and-death chains and Galton-Watson forests. Using these ideas, we establish limit theorems showing that if the first n boxes are occupied independent...
متن کاملBethe Ansatz , Inverse Scattering Transform and Tropical Riemann Theta Function in a Periodic Soliton Cellular Automaton for A ( 1 ) n ?
We study an integrable vertex model with a periodic boundary condition associated with Uq ( A (1) n ) at the crystallizing point q = 0. It is an (n+ 1)-state cellular automaton describing the factorized scattering of solitons. The dynamics originates in the commuting family of fusion transfer matrices and generalizes the ultradiscrete Toda/KP flow corresponding to the periodic box-ball system. ...
متن کاملCreation of ballot sequences in a periodic cellular automaton
Motivated by an attempt to develop a method for solving initial value problems in a class of integrable cellular automata associated with crystal bases, we consider a generalization of a simple theorem in combinatorics. The original theorem asserts that any sequence of letters 1 and 2, and having no less 1’s than 2’s, can be changed into a ballot sequence via cyclic shifts only. Our theorem tre...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2002
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/35/16/317